Synthesizing replacement classes
نویسندگان
چکیده
منابع مشابه
Dynamic Object Replacement and Implementation-Only Classes
GILGUL is an extension of the Java programming language that allows for dynamic object replacement without consistency problems. This is possible in a semantically clean way, because its model strictly separates the notions of reference and comparison that usually are subsumed in the concept of object identity. Since GILGUL’s new operations respect Java’s type system, objects still can be repla...
متن کاملLower Bounds for Protrusion Replacement by Counting Equivalence Classes
Garnero et al. [SIAM J. Discrete Math. 2015, 29(4):1864–1894] recently introduced a framework based on dynamic programming to make applications of the protrusion replacement technique constructive and to obtain explicit upper bounds on the involved constants. They show that for several graph problems, for every boundary size t one can find an explicit setRt of representatives. Any subgraph H wi...
متن کاملSynthesizing Bark
Despite the high quality reached by today’s CG tree generators, there exists no realistic model for generating the appearance of bark: simple texture maps are generally used, showing obvious flaws if the tree is not entirely painted by an artist. Beyond modeling the appearance of bark, difficulty lies in adapting the bark features to the age of each branch, ensuring continuity between adjacent ...
متن کاملSynthesizing Objects
This paper argues that the current OO technology does not support reuse and configurability in an effective way. This problem can be addressed by augmenting OO analysis and design with feature modeling and by applying generative implementation techniques. Feature modeling allows capturing the variability of domain concepts. Concrete concept instances can then be synthesized from abstract specif...
متن کاملSynthesizing intonation
This paper describes a computer program for synthesizing fundamental frequency (F0} contours for English, and sketches the theory which underlies it. The F0 contour is described as a series of targets within an envelope specifying F0 range; the F0 contour between targets is computed by transition rules. The use of nonmonotonic transitions permits a sparser specification of the contour than has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3371120